An Efficient Query Solution for Large RDF Graphs
نویسندگان
چکیده
منابع مشابه
Path Query Processing on Very Large RDF Graphs
Finding the shortest path between two nodes in an RDF graph is a fundamental operation that allows to discover complex relationships between entities. In this paper we consider the path queries over graphs from a database perspective. We provide the full-fledge database solution to execute path queries over very large RDF graphs. We present low-level techniques to speed-up shortest paths algori...
متن کاملDistributed Storage and Query of Large RDF Graphs
RDF tuples are the building blocks of the semantic web. As more data are expressed as RDF tuples, storage capabilities become important. The data set will become increasingly large such that it is necessary for data to be stored across multiple machines. Data set will be partitioned into smaller subsets, each containing an incomplete picture about data relationships. This has implications for q...
متن کاملRDFPath: Path Query Processing on Large RDF Graphs with MapReduce
The MapReduce programming model has gained traction in different application areas in recent years, ranging from the analysis of log files to the computation of the RDFS closure. Yet, for most users the MapReduce abstraction is too low-level since even simple computations have to be expressed as Map and Reduce phases. In this paper we propose RDFPath, an expressive RDF path query language geare...
متن کاملAn Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs
Nowadays, a leading instance of big data is represented by Web data that lead to the definition of so-called big Web data. Indeed, extending beyond to a large number of critical applications (e.g., Web advertisement), these data expose several characteristics that clearly adhere to the well-known 3V properties (i.e., volume, velocity, variety). Resource Description Framework (RDF) is a signific...
متن کاملA Query Approximating Approach Over RDF Graphs
Regardless of the knowledge structure lack about Resource Description Framework (RDF) data, difficulties, principally, occur in specifying and answering queries. Approximate querying is the solution to find relevant information by getting a set of sub structures (e.g. sub graphs) matching the query. Approaches based on the structure and others based on semantic, marginalized the common meaning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2014
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.29.364